package com.leetcode.leetcode2;

/**
 * 下一个排列
 *
 * @author: luhd
 * @create: 2021-09-30
 */
public class Practice31 {

    public static void main(String[] args) {
        int[] nums = {1,2,3};
        int[] ints = nextPermutation(nums);
        System.out.println(ints);
    }

    public static int[] nextPermutation(int[] nums) {

        if (nums == null|| nums.length<=1) {
            return nums;
        }
        int length = nums.length;
        return nums;
    }
}
